System and method for managing transactions

ABSTRACT

A method for writing data, the method may include: receiving or generating, by an interfacing module, a data unit coherent write request for performing a coherent write operation of a data unit to a first address; receiving, by the interfacing module and from a circuit that comprises a cache and a cache controller, a cache coherency indicator that indicates that a most updated version of the content stored at the first address is stored in the cache; and instructing, by the interfacing module, the cache controller to invalidate a cache line of the cache that stored the most updated version of the first address without sending the most updated version of the content stored at the first address from the cache to a memory module that differs from the cache if a length of the data unit equals a length of the cache line.

BACKGROUND OF THE INVENTION

A memory system is coherent if the value read by a data read orinstruction fetch is always the value that was most recently written tothat location. Memory coherency is difficult when the memory systemincludes multiple possible physical locations, such as main memory andat least one of a write buffer or one or more caches (ARM glossary,www.arm.com).

There are various prior art cache coherent interconnect that providefull cache coherency between clusters of multi-core processors (CPUs)and input/output (I/O) coherency for devices such as I/O masters and thelike.

Various system on chip architectures are tailored to applications suchas mobile applications (especially smart phones) where the throughoutand bandwidth are relatively small.

Such architectures may have various drawbacks. Some of these drawbacksinclude:

a. A cache coherent interconnect may be connected to a dynamic randomaccess memory (DRAM) module. Accessing to the DRAM module is timeconsuming and the ARM architecture is characterized by inefficient DRAMaccesses.b. A cache coherent interconnect may prevent pipelining of transactionsrequests that have a same transaction identifier. Thus, when multipletransaction requests that have a same transaction identifier arereceived by the cache coherent interconnect—the cache coherentinterconnect will service only one transaction request at a time—andthis can introduce vary large delays.c. Write operations of portions of a cache line require multiple DRAMread and write operations.

There is a growing need to provide method and systems for enhancing thecapability of interconnects

SUMMARY

According to various embodiments of the invention various methods may beprovided, some are listed below and/or claimed in the claims.

Additional embodiments of the invention include a system arranged toexecute any or all of the methods described above, including anystages—and any combinations of same. Some of the systems are listedbelow and/or claimed in the claims.

Any reference to a method should be interpreted as referring to a systemcapable of executing the method. Any reference to a system should beinterpreted as referring to a method that can be executed by the system.

There may be provided a method for writing data, the method may include:receiving or generating, by an interfacing module, a data unit coherentwrite request for performing a coherent write operation of a data unitto a first address; receiving, by the interfacing module and from acircuit that may include a cache and a cache controller, a cachecoherency indicator that indicates that a most updated version of thecontent stored at the first address is stored in the cache; andinstructing, by the interfacing module, the cache controller toinvalidate a cache line of the cache that stored the most updatedversion of the first address without sending the most updated version ofthe content stored at the first address from the cache to a memorymodule that differs from the cache if a length of the data unit equals alength of the cache line.

The method may include instructing the cache controller to send thecontent of the first address from the cache to the memory module and toinvalidate the cache line of the cache that stored the most updatedversion of the first address if the length of the data unit equals aportion of a length of the cache line.

The method may include receiving by the interfacing module the data unitcoherent write request.

The method may include generating by the interfacing module the dataunit coherent write request.

The method may include: receiving a data chunk coherent write requestfor performing a coherent write operation of a data chunk of a lengththat exceeds the length of the cache line; and converting the data chunkcoherent write request to multiple data unit coherent write requests.

The method may include performing, by an interconnect that is coupledbetween the cache controller and the interfacing module, a snooptransaction that involves invalidating the cache line of the cache thatstored the most updated version of the content stored at the firstaddress without sending the most updated version of the content storedat the first address from the cache to the memory module.

There may be provided a method for writing data, the method may include:receiving or generating, by an interfacing module, a data unit coherentwrite request for performing a coherent write operation of a data unit;receiving, by the interfacing module and from a circuit that may includea cache controller and a cache, a cache coherency indicator thatindicates that a most updated version of the data unit is stored in thecache; and instructing, by the interfacing module, the processor to sendthe most updated version of the content stored at the first address fromthe cache to hierarchy memory module that differs from the cache and toinvalidate a cache line of the cache that stored the most updatedversion of the content stored at the first address if a length of thedata unit equals a portion of a length of the cache line.

The method may include instructing, by the interfacing module, the cachecontroller to invalidate the cache line of the cache that stored themost updated version of the content stored at the first address withoutsending the most updated version of the content stored at the firstaddress from the cache to the memory module if the length of the dataunit equals the length of the cache line.

The method may include receiving by the interfacing module the data unitcoherent write request.

The method may include generating by the interfacing module the dataunit coherent write request.

The method may include: receiving a data chunk coherent write requestfor performing a coherent write operation of a data chunk of a lengththat exceeds the length of the cache line; and converting the data chunkcoherent write request to multiple data unit coherent write requests.

There may be provided a method for performing a transaction, the methodmay include: receiving, by an interfacing module, multiple transactionrequests related to multiple data units; wherein the multipletransaction requests are associated with transaction identifiers of asame value; generating modified transaction requests by replacing thetransaction identifiers with new transaction identifiers; whereindifferent modified transaction requests are associated with newtransaction identifiers that have different values; and sending, by theinterfacing entity, the modified transaction requests to aninterconnect; wherein the interconnect may be arranged to preventpipelining of transaction requests that have new transaction identifiersof a same value; receiving transaction responses to the modifiedtransactions requests; and responding to the transaction responses whilemaintaining an order of arrival of the multiple transaction requests.

The multiple transaction requests are read requests, wherein themodified transaction requests are modified read requests, wherein thetransaction responses may include data units read from modules coupledto the interfacing module; wherein the responding may include outputtingthe data units according to an order of arrival of the multiple readrequests.

The multiple transaction requests are write requests, wherein themodified transaction requests are modified write requests; wherein thewrites may include participating in writing to either one of a cache ofa processor and a dynamic random access memory (DRAM) module coupled tothe interconnect data units, and the write transactions responsesassociated with the multiple write requests returned according to anorder of arrival of the multiple write requests.

The method may include generating, by the interconnect, multiple snooptransactions that are associated with the new transaction identifiers;receiving by the interconnect multiple snoop responses to the snooptransaction; wherein each snoop response indicates whether a transactionrequest should be targeted to the cache controller or to hierarchymemory module that differs from the cache and is coupled to theinterconnect.

There may be provided a system that may include an interfacing modulethat may include: an input output (I/O) circuit; and a transactionrequest processor that is coupled to the I/O circuit; wherein the I/Ocircuit may be arranged to: receive a data unit coherent write requestfor performing a coherent write operation of a data unit; and receive acache coherency indicator that indicates that a most updated version ofthe data unit is stored in a cache of a processor; and wherein thetransaction request processor may be arranged to receive the data unitcoherent write request and the cache coherency indicator and to instructthe processor to invalidate a cache line of the cache that stored themost updated version of the content stored at the first address withoutsending the most updated version of the content stored at the firstaddress from the cache to a memory module that differs from the cache ifa length of the data unit equals a length of the cache line.

The system may include an interconnect that is coupled between theprocessor and the interfacing module.

The interconnect may be arranged to perform a snoop transaction thatinvolves invalidating the cache line of the cache that stored the mostupdated version of the content stored at the first address withoutsending the most updated version of the content stored at the firstaddress from the cache to the memory module.

The system may include a write compressor and a memory controller;wherein the memory controller is coupled to the memory module via amemory bus that is narrower than a width of an interconnect bus; whereinthe write compressor is coupled between the interconnect bus and thememory controller; wherein the write compressor may be arranged to:receive an information entity that may include irrelevant bits and data,the data having a data length that does not exceed a width of the memorybus, and remove at least some of the irrelevant bits to provide amodified information entity that may include the data and zero or moreirrelevant bits.

The interfacing module may be arranged to instruct the processor to sendthe most updated version of the content stored at the first address fromthe cache to the memory module and to invalidate the cache line of thecache that stored the most updated version of the content stored at thefirst address if the length of the data unit equals a portion of thelength of the cache line.

There may be provided a system that may include an interfacing modulethat may include an input output (I/O) circuit and a transaction requestprocessor that is coupled to the I/O circuit; wherein the I/O circuitmay be arranged to: receive a data unit coherent write request forperforming a coherent write operation of a data unit; and receive acache coherency indicator that indicates that a most updated version ofthe data unit is stored in a cache of a processor; and wherein thetransaction request processor may be arranged to receive the data unitcoherent write request and the cache coherency indicator from the I/Ocircuit and to instruct the processor to send the most updated versionof the content stored at the first address from the cache to a memorymodule that differs from the cache and to invalidate a cache line of thecache that stored the most updated version of the content stored at thefirst address if a length of the data unit equals a portion of a lengthof the cache line.

the interfacing module may be arranged to instruct the processor toinvalidate the cache line of the cache that stored the most updatedversion of the content stored at the first address without sending themost updated version of the content stored at the first address from thecache to the DRAM module if the length of the data unit equals thelength of the cache line.

There may be provided a system may include a memory module, a memorycontroller, a cache controller and an interconnect that is coupled tothe memory module and the memory controller; wherein the interfacingmodule may be arranged to issue a read snoop command of a certainaddress to the cache controller; wherein the cache controller may bearranged, if there is a cache hit and the certain address is marked asan address associated with a single producer and single consumer, toeither invalidate a cache line that is located at the certain address ormark that cache line as clean.

The cache controller or the interconnect are arranged to access a listof addresses that are marked as addresses that are associated with asingle producer and single consumer to determine whether the certainaddress is marked as an address associated with a single producer andsingle consumer.

The read snoop command may include an indication of whether the certainaddress is marked as an address associated with a single producer andsingle consumer.

The cache memory controller may be arranged to either invalidate thecache line that is located at the certain address or mark that cacheline as clean only if the read snoop command is associated with readingan entire cache line, there is a cache hit and the certain address ismarked as an address associated with a single producer and singleconsumer.

The cache memory controller may be arranged to be prevented frominvalidate the cache line that is located at the certain address or markthat cache line as clean if the read snoop command is associated withreading only a portion of a cache line, even if there is a cache hit andthe certain address is marked as an address associated with a singleproducer and single consumer.

There may be provided a system that may include an interfacing modulethat may include an input output (I/O) circuit and a transaction requestprocessor that is coupled to the I/O circuit; wherein the I/O circuitmay be arranged to receive multiple transaction requests related tomultiple data units; wherein the multiple transaction requests areassociated with transaction identifiers of a same value; wherein thetransaction request processor may be arranged to: receive from the I/Ocircuit the multiple transaction requests; generate modified transactionrequests by replacing the transaction identifiers with new transactionidentifiers; wherein different modified transaction requests areassociated with new transaction identifiers that have different values;and wherein the I/O circuit is further arranged to: send the modifiedtransaction requests to an interconnect that is coupled to a processor;wherein the interconnect may be arranged to prevent pipelining oftransaction requests that have new transaction identifiers of a samevalue; and receive transaction responses to the modified transactionsrequests; and wherein the transaction request processor is furtherarranged to respond to the transaction responses while maintaining anorder of arrival of the multiple transaction requests.

There may be provided a system that may include a cache controller forcontrolling a cache, a memory module that differs from the cache, awrite compressor, a memory controller for controlling the memory module,and an interconnect; wherein the memory controller is coupled to thememory module via a memory bus that is narrower than a width of aninterconnect bus; wherein the write compressor is coupled between theinterconnect bus and the memory controller; wherein the write compressoris arranged to: receive an information entity that comprises irrelevantbits and data, the data having a data length that does not exceed awidth of the memory bus, and remove at least some of the irrelevant bitsto provide a modified information entity that comprises the data andzero or more irrelevant bits.

There may be provided a method that may include issuing, by aninterfacing module a read snoop command of a certain address to a cachecontroller; determining if there is a cache hit and the certain addressis marked as an address associated with a single producer and singleconsumer; and either invalidating a cache line that is located at thecertain address or marking that cache line as clean if it is determinedthat there is a cache hit and the certain address is marked as anaddress associated with a single producer and single consumer.

The method may be executed by a system that includes a memory module, amemory controller, a cache controller and an interconnect that iscoupled to the memory module and the memory controller.

There may be provided a method that may include receiving by a writecompressor an information entity that comprises irrelevant bits anddata, the data having a data length that does not exceed a width of amemory bus; and removing at least some of the irrelevant bits to providea modified information entity that comprises the data and zero or moreirrelevant bits; wherein the memory bus couples between the memorycontroller to a memory module that differs from a cache; wherein thememory bus is narrower than an interconnect bus; wherein the writecompressor is coupled between the interconnect bus and the memorycontroller.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter regarded as the invention is particularly pointed outand distinctly claimed in the concluding portion of the specification.The invention, however, both as to organization and method of operation,together with objects, features, and advantages thereof, may best beunderstood by reference to the following detailed description when readwith the accompanying drawings in which:

FIG. 1 illustrates a system according to an embodiment of the invention;

FIG. 2 illustrates a system according to an embodiment of the invention;

FIG. 3 illustrates a method according to an embodiment of the invention;and

FIG. 4 illustrates a method according to an embodiment of the invention.

It will be appreciated that for simplicity and clarity of illustration,elements shown in the figures have not necessarily been drawn to scale.For example, the dimensions of some of the elements may be exaggeratedrelative to other elements for clarity. Further, where consideredappropriate, reference numerals may be repeated among the figures toindicate corresponding or analogous elements.

DETAILED DESCRIPTION OF THE DRAWINGS

In the following detailed description, numerous specific details may beset forth in order to provide a thorough understanding of the invention.However, it will be understood by those skilled in the art that thepresent invention may be practiced without these specific details. Inother instances, well-known methods, procedures, and components have notbeen described in detail so as not to obscure the present invention.

The subject matter regarded as the invention is particularly pointed outand distinctly claimed in the concluding portion of the specification.The invention, however, both as to organization and method of operation,together with objects, features, and advantages thereof, may best beunderstood by reference to the following detailed description when readwith the accompanying drawings.

It will be appreciated that for simplicity and clarity of illustration,elements shown in the figures have not necessarily been drawn to scale.For example, the dimensions of some of the elements may be exaggeratedrelative to other elements for clarity. Further, where consideredappropriate, reference numerals may be repeated among the figures toindicate corresponding or analogous elements.

Because the illustrated embodiments of the present invention may for themost part, be implemented using electronic components and circuits knownto those skilled in the art, details will not be explained in anygreater extent than that considered necessary as illustrated above, forthe understanding and appreciation of the underlying concepts of thepresent invention and in order not to obfuscate or distract from theteachings of the present invention.

The following description refers to a DRAM memory although it can beapplicable, according to various embodiments of the invention, to othertypes of memory modules.

Reducing Cache to DRAM Write Operations

FIG. 1 illustrates a system 100 according to an embodiment of theinvention.

System 100 may be a system on chip (SOC), may include an SOC, may bepart of a SOC, may include one or more semiconductors dies, and thelike.

System 100 includes processor 10, input/output (I/O) master 130,interfacing module 30, interconnect 20, dynamic random access memory(DRAM) controller 60, DRAM module 70 and I/O slave 90. Processor 10includes a cache 15. Cache 15 includes multiple cache lines such ascache line 15(1).

The interconnect 20 is connected to the processor 10, the interfacingmodule 30, the I/O slave 90 and the DRAM controller 60. The DRAMcontroller 60 is also connected to the DRAM module 70.

The DRAM module 70 can have a cacheable memory space and this cacheablememory space can be a portion of the DRAM module 70 or the entire DRAMmodule 70. The cacheable memory space should store (at certain points oftime) the same content as the cache 15. The cacheable memory space andthe cache 15 may be addressed by the same addresses.

The interconnect 20 may be a corelink CCI-400 cache coherentinterconnect or may by any other cache coherent interconnect thatpreserves the memory coherency. The memory coherency may be preserved byperforming snoop transactions that assist in determining where the mostupdated version of a data unit is stored (in the DRAM module 70 or incache 15).

The interfacing module 30 includes an I/O circuit 31 and a transactionrequest processor 32 that is coupled to the I/O circuit 31.

The I/O circuit 31 may be arranged to (a) receive a data unit coherentwrite request for performing a coherent write operation of a data unit;and (b) receive a cache coherency indicator that indicates that a mostupdated version of the data unit is stored in a cache of a processor.

The transaction request processor 32 may be arranged to receive the dataunit coherent write request and the cache coherency indicator and toinstruct the processor 10 (or provide the data unit coherent writerequest to the interconnect 20 that in turn instructs the processor 10)to invalidate a cache line of the cache that stored the most updatedversion of the data unit without sending the most updated version of thecontent stored at the first address from the cache 15 to the DRAM module70 if a length of the data unit equals a length of the cache line. Thismost updated version of the content stored at the first address is olderthan the currently received data unit.

The interconnect 20 may be arranged to perform, in response to areception of the data unit coherent write request, a snoop transactionthat involves invalidating the cache line of the cache 15 that storedthe most updated version of the content stored at the first addresswithout sending the most updated version of the content stored at thefirst address from the cache to the DRAM module.

The interfacing module 30 may be arranged to receive the data unitcoherent write request and the cache coherency indicator from the I/Ocircuit and to instruct the processor to send the most updated versionof the content stored at the first address from the cache 15 to the DRAMmodule 70 and to invalidate a cache line of the cache 15 that stored themost updated version of the content stored at the first address if alength of the data unit equals a portion of a length of the cache line.

Pipelining Transaction Requests

According to another embodiment of the invention the interfacing moduleis arranged to speed up the processing of transaction requests bybypassing the interconnect anti-pipelining mechanism that preventspipelining of transaction requests that share the same transactionidentifier.

The I/O circuit 31 of the interfacing unit 30 may be arranged to receivemultiple transaction requests related to multiple data units. If thetransaction identifiers of these multiple transaction requests differfrom each other then they can be sent to the interconnect. Theinterconnect 20 may pipeline these transaction requests.

If, for example, the multiple transaction requests are associated withtransaction identifiers of a same value then the transaction requestprocessor 32 may be arranged to:

a. Receive from the I/O circuit 31 the multiple transaction requests.b. Generate modified transaction requests by replacing the transactionidentifiers with new transaction identifiers; wherein different modifiedtransaction requests are associated with new transaction identifiersthat have different values.c. Send the modified transaction identifiers to the I/O circuit than inturn sends the modified transaction requests to an interconnect that iscoupled to a processor; wherein the interconnect is arranged to preventpipelining of transaction requests that have new transaction identifiersof a same value.d. Receive from the I/O circuit 31 transaction responses to the modifiedtransactions requests.e. Respond to the transaction responses while maintaining an order ofarrival of the multiple transaction requests.

FIG. 2 illustrates a system 101 according to another embodiment of theinvention.

System 101 differs from system 100 of FIG. 1 by:

a. Including three interfacing modules (30, 40 and 80) instead of asingle interfacing module (30).b. Having a pair of I/O masters (130 and 140) instead of a single I/Omaster (130).c. Having a write compressor 50 that is coupled between the interconnect20 and the DRAM controller 60.d. Having a processor 10 that includes four cores 11-14 and cache 15.e. Having a bridge 52 (such as an ACI bridge) between the interconnect20 and the write compressor 50.

Interfacing module 30 may be equal to the interfacing module 40.

Interfacing module 80 can speed up the interaction between the processor10 and external modules by:

a. Receiving a transaction request from the processor 10 that is aimedto an external module (an external module such as a register outsidesystem 101).b. Sending the transaction request to the external module.c. Providing an acknowledgement to the processor 10 that releases theprocessor 10 from waiting to a response from the external module—beforethe external module provides such an acknowledgement.d. The provision of the acknowledgement and, additionally oralternatively, the sending of the transaction request to the externalmodule may include maintaining a coherency between read and writetransactions addressed to the same external module (or—if the externalmodule has multiple addresses—to the same address)—by delaying aresponse to a read request before a completion of a write requestdestined to the same address.e. The provision of the acknowledgement and, additionally oralternatively, the sending of the transaction request to the externalmodule may include delaying the sending of the request to the externalmodule if the transaction request is of a type that requires that aprevious transaction request sent to the same external module will beresponded by the external module before the interfacing module may sendthe transaction request to the external module. Alternatively—theprovision of the acknowledgement and, additionally or alternatively, thesending of the transaction request to the external module may includedelaying the sending of the request to the external module if thetransaction request is of a type that requires that a predeterminedperiod will lapse from the sending of the previous transaction requestto the same external module—so that the external module is expected tobe ready to respond to the delayed transaction request. This can beapplicable, for example, in AXI protocol device type of transactionrequests. It is noted that the delayed transaction request and theprevious transaction request can be aimed to different addresses (forexample—they can be associated with a read pointer and a write pointerof a buffer).

The DRAM controller 60 may be coupled to the DRAM module 70 via a DRAMbus 67 that is narrower than a width of an interconnect bus 25 betweenthe interconnect 20 and the write compressor 50.

The write compressor 50 can assist in reducing the amount oftransactions between the DRAM controller 60 and the DRAM module 70 byremoving irrelevant bits such as padding bits that may be added to adata unit in order to provide an information entity that has a width ofthe interconnect bus 25.

The write compressor 50 may be arranged to receive an information entitythat comprises irrelevant bits and data, the data having a data lengththat does not exceed a width of the DRAM bus, and remove at least someof the irrelevant bits to provide a modified information entity thatcomprises the data and zero or more irrelevant bits.

According to an embodiment of the invention the DRAM controller 60 isarranged to receive from the interconnect a cache line wide informationunit and is arranged to perform an error correction coding (ECC) processon all of the cache line bits—if at least some of the bits are flaggedas being valid. The ECC process can be applied on the entire informationunit but is usually applied on information sub-units. For example, theinformation unit can be 64 bytes long, and the ECC process is applied oninformation sub-units of 16 bytes long. The write compressor 50 canreceive an information unit that is 64 bytes long and that includes asingle valid information sub-unit and three invalid informationsub-units. It is noted that information units and sub-units of differentlengths and different ratios can be compressed or outputted by the writecompressor 50.

The write compressor 50 can send only the single valid sub-unit to theDRAM controller 60 and the DRAM controller 60 will perform the ECCprocess only on that single valid sub-unit and perform only a single ECCprocess instead of four ECC processes. FIG. 2 illustrates the writecompressor 50 that receives an information unit that includes fourinformation sub-units 201(1)-201(4) of which only 201(2) is valid,wherein the write compressor 50 outputs only the valid informationsub-unit 201(2).

FIG. 3 illustrates method 300 for writing data according to anembodiment of the invention.

Method 300 may start by stage 310 of receiving or generating, by aninterfacing module, a data unit coherent write request for performing acoherent write operation of a data unit to a first address. The firstaddress can be a virtual addressor a physical address. It can be anyaddress within the cache or a cacheable space of the DRAM module.

Stage 310 is followed by stage 320 of providing the data unit coherentwrite request to an interconnect that is coupled to a processor that hasa cache.

Stage 320 may be followed by stage 330 of sending to the processor asnoop transaction that is aimed to determine where the most updatedversion of the data unit (before the received data unit) is stored.

Stage 330 may be followed by stage 340 of receiving, by the interconnecta snoop response to the snoop transaction.

Stage 340 may be followed by stage 350 of sending to the interfacingmodule the snoop response. The snoop response includes a cache coherencyindicator that indicates if the most updated version of the data unit isstored in the cache or in the DRAM module.

If the cache coherency indicator indicates that the most updated versionof the data unit is stored in the DRAM module then stage 350 is followedby stage 355 of writing the data unit to the DRAM module 70 withoutaccessing the processor 10.

If the cache coherency indicator indicates that the most updated versionof the data unit is stored in the cache then stage 350 is followed bystage 360 of checking whether the a length of the data unit equals alength of a cache line or is shorter than the length of the cache line.

If it is determined that the length of the data unit equals a length ofthe cache line then stage 360 is followed by stage 370 of instructing,by the interfacing module, the processor to invalidate a cache line ofthe cache that stored the most updated version of the content stored atthe first address without sending the most updated version of thecontent stored at the first address from the cache to the DRAM module.

If it is determined that the length of the data unit equals a portion ofthe length of the cache line then stage 360 is followed by stage 380 ofinstructing the processor to send the most updated version of thecontent stored at the first address from the cache to the DRAM moduleand to invalidate a cache line of the cache that stored the most updatedversion of the data unit.

Stage 380 may be followed by stage 390 of replacing a portion of thecontent of the cache line with the data unit to provide a modifiedcontent and storing the modified content in the DRAM module.

It is noted that stages 310-390 may operate on write requests that referto data units of a length that does not exceed a length of a cache line.Under this scenario write requests (such as data chunk coherent writerequests) that relate to data units to data chunks that are longer thana single cache line are replaced by multiple data unit coherent writerequests). Thus, stage 310 may include receiving a data chunk coherentwrite request for performing a coherent write operation of a data chunkof a length that exceeds the length of the cache line; and convertingthe data chunk coherent write request to multiple data unit coherentwrite requests.

FIG. 4 illustrates method 400 for performing a transaction according toan embodiment of the invention.

Method 400 may start by stage 410 of receiving, by an interfacingmodule, multiple transaction requests related to multiple data units.

Stage 410 may be followed 420 of determining whether the multipletransaction requests have the same transaction identifiers or not.

If it is determined that the multiple transaction requests areassociated with different transaction identifiers then stage 420 isfollowed by stage 430 of sending the multiple transaction requests tothe interconnect.

If it is determined that the multiple transaction requests areassociated with transaction identifiers of a same value then stage 420is followed by stage 440 of generating modified transaction requests byreplacing the transaction identifiers with new transaction identifiers;wherein different modified transaction requests are associated with newtransaction identifiers that have different values.

Stage 440 may be followed by stage 450 of sending, by the interfacingentity, the modified transaction requests to an interconnect that iscoupled to a processor; wherein the interconnect is arranged to preventpipelining of transaction requests that have new transaction identifiersof a same value.

Stage 450 may be followed by stage 460 of managing the modifiedtransaction requests.

Stage 460 may includes receiving transaction responses to the modifiedtransactions requests.

Stage 460 may include generating, by the interconnect, multiple snooptransactions that are associated with the new transaction identifiersand receiving by the interconnect multiple snoop responses to the snooptransaction. Each snoop response indicates whether a transaction requestshould be targeted to the processor or to a dynamic random access memory(DRAM) module coupled to the interconnect.

Stage 460 may be followed by stage 480 of responding to the transactionresponses while maintaining an order of arrival of the multipletransaction requests.

According to an embodiment of the invention the multiple transactionrequests are read requests, the modified transaction requests aremodified read requests, the transaction responses include data unitsread from either one of a cache of the processor and a DRAM modulecoupled to the interconnect and the responding (480) comprisesoutputting the data units according to an order of arrival of themultiple read requests. This can be performed by storing informationrelating to the order of arrival of the different transaction requests(such as the order in which the new sequence identifiers were generated)and buffering each data unit until at least all the data units that areassociated with older transaction requests have been outputted to theI/O masters). A re-ordering buffer can be used in this instance.

According to another embodiment of the invention the multipletransaction requests are write requests, the modified transactionrequests are modified write requests and the responding (480) includesparticipating in writing (to either one of a cache of the processor anda DRAM module coupled to the interconnect) data units associated withthe multiple write requests according to an order of arrival of themultiple write requests.

In the foregoing specification, the invention has been described withreference to specific examples of embodiments of the invention. It will,however, be evident that various modifications and changes may be madetherein without departing from the broader spirit and scope of theinvention as set forth in the appended claims.

Moreover, the terms “front,” “back,” “top,” “bottom,” “over,” “under”and the like in the description and in the claims, if any, are used fordescriptive purposes and not necessarily for describing permanentrelative positions. It is understood that the terms so used areinterchangeable under appropriate circumstances such that theembodiments of the invention described herein are, for example, capableof operation in other orientations than those illustrated or otherwisedescribed herein.

The connections as discussed herein may be any type of connectionsuitable to transfer signals from or to the respective nodes, units ordevices, for example via intermediate devices. Accordingly, unlessimplied or stated otherwise, the connections may for example be directconnections or indirect connections. The connections may be illustratedor described in reference to being a single connection, a plurality ofconnections, unidirectional connections, or bidirectional connections.However, different embodiments may vary the implementation of theconnections. For example, separate unidirectional connections may beused rather than bidirectional connections and vice versa. Also,plurality of connections may be replaced with a single connection thattransfers multiple signals serially or in a time multiplexed manner.Likewise, single connections carrying multiple signals may be separatedout into various different connections carrying subsets of thesesignals. Therefore, many options exist for transferring signals.

Although specific conductivity types or polarity of potentials have beendescribed in the examples, it will be appreciated that conductivitytypes and polarities of potentials may be reversed.

Each signal described herein may be designed as positive or negativelogic. In the case of a negative logic signal, the signal is active lowwhere the logically true state corresponds to a logic level zero. In thecase of a positive logic signal, the signal is active high where thelogically true state corresponds to a logic level one. Note that any ofthe signals described herein can be designed as either negative orpositive logic signals. Therefore, in alternate embodiments, thosesignals described as positive logic signals may be implemented asnegative logic signals, and those signals described as negative logicsignals may be implemented as positive logic signals.

Furthermore, the terms “assert” or “set” and “negate” (or “deassert” or“clear”) are used herein when referring to the rendering of a signal,status bit, or similar apparatus into its logically true or logicallyfalse state, respectively. If the logically true state is a logic levelone, the logically false state is a logic level zero. And if thelogically true state is a logic level zero, the logically false state isa logic level one.

Those skilled in the art will recognize that the boundaries betweenlogic blocks are merely illustrative and that alternative embodimentsmay merge logic blocks or circuit elements or impose an alternatedecomposition of functionality upon various logic blocks or circuitelements. Thus, it is to be understood that the architectures depictedherein are merely exemplary, and that in fact many other architecturescan be implemented which achieve the same functionality.

Any arrangement of components to achieve the same functionality iseffectively “associated” such that the desired functionality isachieved. Hence, any two components herein combined to achieve aparticular functionality can be seen as “associated with” each othersuch that the desired functionality is achieved, irrespective ofarchitectures or intermedial components. Likewise, any two components soassociated can also be viewed as being “operably connected,” or“operably coupled,” to each other to achieve the desired functionality.

Furthermore, those skilled in the art will recognize that boundariesbetween the above described operations merely illustrative. The multipleoperations may be combined into a single operation, a single operationmay be distributed in additional operations and operations may beexecuted at least partially overlapping in time. Moreover, alternativeembodiments may include multiple instances of a particular operation,and the order of operations may be altered in various other embodiments.

Also for example, in one embodiment, the illustrated examples may beimplemented as circuitry located on a single integrated circuit orwithin a same device. Alternatively, the examples may be implemented asany number of separate integrated circuits or separate devicesinterconnected with each other in a suitable manner.

Also for example, the examples, or portions thereof, may implemented assoft or code representations of physical circuitry or of logicalrepresentations convertible into physical circuitry, such as in ahardware description language of any appropriate type.

Also, the invention is not limited to physical devices or unitsimplemented in non-programmable hardware but can also be applied inprogrammable devices or units able to perform the desired devicefunctions by operating in accordance with suitable program code, such asmainframes, minicomputers, servers, workstations, personal computers,notepads, personal digital assistants, electronic games, automotive andother embedded systems, cell phones and various other wireless devices,commonly denoted in this application as ‘computer systems’.

However, other modifications, variations and alternatives are alsopossible. The specifications and drawings are, accordingly, to beregarded in an illustrative rather than in a restrictive sense.

In the claims, any reference signs placed between parentheses shall notbe construed as limiting the claim. The word ‘comprising’ does notexclude the presence of other elements or steps then those listed in aclaim. Furthermore, the terms “a” or “an,” as used herein, are definedas one or more than one. Also, the use of introductory phrases such as“at least one” and “one or more” in the claims should not be construedto imply that the introduction of another claim element by theindefinite articles “a” or “an” limits any particular claim containingsuch introduced claim element to inventions containing only one suchelement, even when the same claim includes the introductory phrases “oneor more” or “at least one” and indefinite articles such as “a” or “an.”The same holds true for the use of definite articles. Unless statedotherwise, terms such as “first” and “second” are used to arbitrarilydistinguish between the elements such terms describe. Thus, these termsare not necessarily intended to indicate temporal or otherprioritization of such elements. The mere fact that certain measures arerecited in mutually different claims does not indicate that acombination of these measures cannot be used to advantage.

While certain features of the invention have been illustrated anddescribed herein, many modifications, substitutions, changes, andequivalents will now occur to those of ordinary skill in the art. It is,therefore, to be understood that the appended claims are intended tocover all such modifications and changes as fall within the true spiritof the invention.

1-31. (canceled)
 32. A system comprising: an interfacing module thatcomprises an input output (I/O) circuit and a transaction requestprocessor; a memory module; a memory controller; a cache controller; andan interconnect that is coupled to the memory module and the memorycontroller, wherein the interfacing module is arranged to issue a readsnoop command of a certain address to the cache controller, and whereinthe cache controller is arranged, if there is a cache hit and thecertain address is marked as an address associated with a singleproducer and single consumer, to either invalidate a cache line that islocated at the certain address or mark that cache line as clean.
 33. Thesystem according to claim 32, wherein the cache controller is arrangedto invalidate the cache line if there is a cache hit and the certainaddress is marked as an address associated with a single producer andsingle consumer.
 34. The system according to claim 32, wherein the cachecontroller is arranged to mark the cache line as clean if there is acache hit and the certain address is marked as an address associatedwith a single producer and single consumer.
 35. The system according toclaim 32, wherein the cache controller is arranged to access a list ofaddresses that are marked as addresses that are associated with a singleproducer and single consumer to determine whether the certain address ismarked as an address associated with a single producer and singleconsumer.
 36. The system according to claim 32, wherein the interconnectis arranged to access a list of addresses that are marked as addressesthat are associated with a single producer and single consumer todetermine whether the certain address is marked as an address associatedwith a single producer and single consumer.
 37. The system according toclaim 32, wherein the read snoop command includes an indication ofwhether the certain address is marked as an address associated with asingle producer and single consumer.
 38. The system according to claim32, wherein the cache memory controller is arranged to invalidate thecache line only if the read snoop command is associated with reading anentire cache line, there is a cache hit and the certain address ismarked as an address associated with a single producer and singleconsumer.
 39. The system according to claim 32, wherein the cache memorycontroller is arranged to mark that cache line as clean only if the readsnoop command is associated with reading an entire cache line, there isa cache hit and the certain address is marked as an address associatedwith a single producer and single consumer.
 40. The system according toclaim 32, wherein the cache memory controller is arranged to beprevented from invalidating the cache line if the read snoop command isassociated with reading only a portion of a cache line, even if there isa cache hit and the certain address is marked as an address associatedwith a single producer and single consumer.
 41. The system according toclaim 32, wherein the cache memory controller is arranged to beprevented from marking the cache line as clean if the read snoop commandis associated with reading only a portion of a cache line, even if thereis a cache hit and the certain address is marked as an addressassociated with a single producer and single consumer.
 42. A methodcomprising: issuing, by an interfacing module, a read snoop command of acertain address to a cache controller; determining if there is a cachehit and the certain address is marked as an address associated with asingle producer and single consumer; and either invalidating a cacheline that is located at the certain address or marking that cache lineas clean if there is a cache hit and the certain address is marked as anaddress associated with a single producer and single consumer.
 43. Themethod of claim 42, wherein the cache line is invalidated if there is acache hit and the certain address is marked as an address associatedwith a single producer and single consumer.
 44. The method of claim 42,wherein the cache line is marked as clean if there is a cache hit andthe certain address is marked as an address associated with a singleproducer and single consumer.
 45. The method of claim 42, wherein thecache controller accesses a list of addresses that are marked asaddresses that are associated with a single producer and single consumerto determine whether the certain address is marked as an addressassociated with a single producer and single consumer.
 46. The method ofclaim 42, wherein the read snoop command includes an indication ofwhether the certain address is marked as an address associated with asingle producer and single consumer.
 47. The method of claim 42, whereinthe cache line is invalidated only if the read snoop command isassociated with reading an entire cache line, there is a cache hit, andthe certain address is marked as an address associated with a singleproducer and single consumer.
 48. The method of claim 42, wherein thecache line is marked as clean only if the read snoop command isassociated with reading an entire cache line, there is a cache hit, andthe certain address is marked as an address associated with a singleproducer and single consumer.
 49. The method of claim 42, wherein thecache line is prevented from being invalidated if the read snoop commandis associated with reading only a portion of the cache line, even whenthere is a cache hit and the certain address is marked as an addressassociated with a single producer and single consumer.
 50. The method ofclaim 42, wherein the cache line is prevented from being marked as cleanif the read snoop command is associated with reading only a portion ofthe cache line, even when there is a cache hit and the certain addressis marked as an address associated with a single producer and singleconsumer.